A Lower Bound on the Disconnection Time of a Discrete Cylinder
نویسنده
چکیده
We study the asymptotic behavior for large N of the disconnection time TN of simple random walk on the discrete cylinder (Z/NZ)d × Z. When d is sufficiently large, we are able to substantially improve the lower bounds on TN previously derived in [3], for d ≥ 2. We show here that the laws of N/TN are tight.
منابع مشابه
On the Disconnection of a Discrete Cylinder by a Biased Random Walk
We consider a random walk on the discrete cylinder (Z/NZ)×Z, d ≥ 3 with drift N in the Z-direction and investigate the large N -behavior of the disconnection time T disc N , defined as the first time when the trajectory of the random walk disconnects the cylinder into two infinite components. We prove that, as long as the drift exponent α is strictly greater than 1, the asymptotic behavior of T...
متن کاملOn the Disconnection of a Discrete Cylinder by a Biased Random Walk by David Windisch
We consider a random walk on the discrete cylinder (Z/NZ)d×Z, d ≥ 3 with drift N−dα in the Z-direction and investigate the large N -behavior of the disconnection time T disc N , defined as the first time when the trajectory of the random walk disconnects the cylinder into two infinite components. We prove that, as long as the drift exponent α is strictly greater than 1, the asymptotic behavior ...
متن کاملWavelet Based Estimation of the Derivatives of a Density for a Discrete-Time Stochastic Process: Lp-Losses
We propose a method of estimation of the derivatives of probability density based on wavelets methods for a sequence of random variables with a common one-dimensional probability density function and obtain an upper bound on Lp-losses for such estimators. We suppose that the process is strongly mixing and we show that the rate of convergence essentially depends on the behavior of a special quad...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007